The Routing of Complex Contagion in Kleinberg's Small-World Networks

In Kleinberg’s small-world network model, strong ties are modeled as deterministic edges in the underlying base grid and weak ties are modeled as random edges connecting remote nodes. The probability of connecting a node u with node v through a weak tie is proportional to 1/|uv|, where |uv| is the grid distance between u and v and α ≥ 0 is the parameter of the model. Complex contagion refers to the propagation mechanism in a network where each node is activated only after k ≥ 2 neighbors of the node are activated. In this paper, we propose the concept of routing of complex contagion (or complex routing), where at each time step we can select one eligible node (nodes already having two active neighbors) to activate, with the goal of activating the pre-selected target node in the end. We consider decentralized routing scheme where only the links connected to already activated nodes are known to the selection strategy. We study the routing time of complex contagion and compare the result with simple routing and complex diffusion (the diffusion of complex contagion, where all eligible nodes are activated immediately in the same step with the goal of activating all nodes in the end). We show that for decentralized complex routing, the routing time is lower bounded by a polynomial in n (the number of nodes in the network) for all range of α both in expectation and with high probability (in particular, Ω(n 1 α+2 ) for α ≤ 2 and Ω(n α 2(α+2) ) for α > 2 in expectation). Our results indicate that complex routing is exponentially harder than both simple routing and complex diffusion at the sweetspot of α = 2.